A Performant Clustering Approach Based on An Improved Sine Cosine Algorithm

نویسندگان

چکیده

Image segmentation is a fundamental and important step in many computer vision applications. One of the most widely used image techniques clustering. It process segmenting intensities non-homogeneous into homogeneous regions based on their similarity property. However, clustering methods require prior initialization random centers often converge to local optimum, thanks choices initial centers, which major drawback. Therefore, overcome this problem, we improved version sine-cosine algorithm optimize traditional improve results. The proposed method provides better exploration search space compared original SCA only focuses best solution generate new solution. ISCA able speed up convergence avoid falling optima by introducing two mechanisms that take account first given position second found so far balance exploitation. performance approach was evaluated comparing several algorithms metaheuristics such as SCA, genetic (GA) particle swarm optimization (PSO). Our evaluation results were analyzed fitness values metrics paper, demonstrates high gives satisfactory other comparison methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach

In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...

متن کامل

A Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population

Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...

متن کامل

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

An Improved Clustering Algorithm

This paper introduces an improved clustering algorithm GCA(Gravitational Clustering Algorithm ), it is extended in such a way that the Gravitational Law is not the only law that can be applied. This algorithm can decide automatically the number of clusters in the target data set, and find any clusters with arbitrary forms and filter the noisy data. The experimental results show that GCA algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computing

سال: 2022

ISSN: ['2312-5381', '1727-6209']

DOI: https://doi.org/10.47839/ijc.21.2.2584